The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraph
نویسندگان
چکیده
منابع مشابه
The Eigenvectors of the Zero Laplacian and Signless Laplacian Eigenvalues of a Uniform Hypergraph
In this paper, we show that the eigenvectors of the zero Laplacian and signless Lapacian eigenvalues of a k-uniform hypergraph are closely related to some configured components of that hypergraph. We show that the components of an eigenvector of the zero Laplacian or signless Lapacian eigenvalue have the same modulus. Moreover, under a canonical regularization, the phases of the components of t...
متن کاملH-eigenvalues of Laplacian and Signless Laplacian Tensors
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H-eigenvalues, i.e., H-eigenvalues with nonnegative H-eigenvectors, and H-eigenvalues, i.e., H-eigenvalues with positive H-eigenvectors. We show that each of the Laplacian tensor, the signless Laplacian tensor, and the adjacency tensor has at most one H-eigenva...
متن کاملThe eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
In this paper, we show that the eigenvectors associated with the zero eigenvalues of the Laplacian and signless Lapacian tensors of a k-uniform hypergraph are closely related to some configured components of that hypergraph. We show that the components of an eigenvector associated with the zero eigenvalue of the Laplacian or signless Lapacian tensor have the same modulus. Moreover, under a cano...
متن کاملNordhaus-Gaddum Type Inequalities for Laplacian and Signless Laplacian Eigenvalues
Let G be a graph with n vertices. We denote the largest signless Laplacian eigenvalue of G by q1(G) and Laplacian eigenvalues of G by μ1(G) > · · · > μn−1(G) > μn(G) = 0. It is a conjecture on Laplacian spread of graphs that μ1(G)−μn−1(G) 6 n − 1 or equivalently μ1(G) + μ1(G) 6 2n − 1. We prove the conjecture for bipartite graphs. Also we show that for any bipartite graph G, μ1(G)μ1(G) 6 n(n − ...
متن کاملSignless Laplacian eigenvalues and circumference of graphs
In this paper, we investigate the relation between the Q -spectrum and the structure of G in terms of the circumference of G. Exploiting this relation, we give a novel necessary condition for a graph to be Hamiltonian by means of its Q -spectrum. We also determine the graphs with exactly one or two Q -eigenvalues greater than or equal to 2 and obtain all minimal forbidden subgraphs and maximal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.11.020